Minimization of functionals on the solution of a large-scale discrete ill-posed problem?
نویسندگان
چکیده
In this work we study the minimization of a linear functional defined on a set of approximate solutions of a discrete ill-posed problem. The primary application of interest is the computation of confidence intervals for components of the solution of such a problem. We exploit the technique introduced by Eldén in 1990, utilizing a parametric programming reformulation involving the solution of a sequence of quadratically constrained least squares problems. Our iterative method, which uses the connection between Lanczos bidiagonalization and Gauss-type quadrature rules to bound certain matrix functionals, is well-suited for large-scale problems, and offers a significant reduction in matrix-vector product evaluations relative to available methods.
منابع مشابه
Minimization of Linear Functionals Defined on Solutions of Large-scale Discrete Ill-posed Problems
The minimization of linear functionals defined on the solutions of discrete ill-posed problems arises, e.g., in the computation of confidence intervals for these solutions. In 1990, Eldén proposed an algorithm for this minimization problem based on a parametric programming reformulation involving the solution of a sequence of trust-region problems, and using matrix factorizations. In this paper...
متن کاملPiecewise Differentiable Minimization for Ill-posed Inverse Problems Ing from the National Science Foundation and Ibm Corporation, with Additional Support from New York State and Members of Its Corporate Research Institute. 1
Based on minimizing a piecewise diierentiable lp function subject to a single inequality constraint, this paper discusses algorithms for a discretized regularization problem for ill-posed inverse problems. We examine computational challenges of solving this regularization problem. Possible minimization algorithms such as the steepest descent method, iteratively weighted least squares (IRLS) met...
متن کاملProjected Tikhonov Regularization of Large-Scale Discrete Ill-Posed Problems
The solution of linear discrete ill-posed problems is very sensitive to perturbations in the data. Confidence intervals for solution coordinates provide insight into the sensitivity. This paper presents an efficient method for computing confidence intervals for large-scale linear discrete ill-posed problems. The method is based on approximating the matrix in these problems by a partial singular...
متن کاملA regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method
The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...
متن کاملNumerical Solution of a Free Boundary Problem from Heat Transfer by the Second Kind Chebyshev Wavelets
In this paper we reduce a free boundary problem from heat transfer to a weakly Singular Volterra integral equation of the first kind. Since the first kind integral equation is ill posed, and an appropriate method for such ill posed problems is based on wavelets, then we apply the Chebyshev wavelets to solve the integral equation. Numerical implementation of the method is illustrated by two ben...
متن کامل